Bifurcations of a non-gravitational interaction problem
نویسندگان
چکیده
This paper studies a particular planar problem which can be related to the interaction of two bodies under the action of a non-gravitational force field. Specifically, the mathematical description of this problem is a system of ordinary differential equations depending on a parameter m. We investigate the topological structure of this system as m varies along the entire real line R. As we shall see there are five distinct cases for all m 2 R. A bifurcation scenario occurs at m 1⁄4 0 and m 1⁄4 2, respectively. Our study partly recovers the results known in Mcgehee (1981). 2014 Elsevier Inc. All rights reserved.
منابع مشابه
Simulation study of Hemodynamic in Bifurcations for Cerebral Arteriovenous Malformation using Electrical Analogy
Background and Objective: Cerebral Arteriovenous Malformation (CAVM) hemodynamic is disease condition, results changes in the flow and pressure level in cerebral blood vessels. Measuring flow and pressure without catheter intervention along the vessel is big challenge due to vessel bifurcations/complex bifurcations in Arteriovenous Malformation patients. The vessel geometry in CAVM patients are...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 251 شماره
صفحات -
تاریخ انتشار 2015